Integer summing algorithms on reconfigurable meshes

Integer Summing Algorithms on Reconfigurable Meshes

This paper presents the following algorithms to compute the sum of n d-bit integers on reconfigurable parallel computation models: (1) a constant-time algorithm on a reconfigurable mesh of the bit model of size &log(‘(‘)) n x dfi, (2) an O(log*n)-time algorithm on a reconfigurable mesh of the bit model of size dm x ddm, (3) an O(logd + log*n)-time algorithm on a reconfigurable mesh of the word ...

Integer Problems on Reconfigurable Meshes, with Applications*

Problems with solutions based upon integer computations are collectively referred to as integer problems. Such problems occur routinely in pattern recognition, image processing, graph theory, and query processing. The purpose of this paper is to present constant time algorithms for computing the prefix sums of an integer sequence, and for solving the packing problem on reconfigurable meshes. Th...

Optimal Algorithms on Reconfigurable Meshes

Ultrafast Graph Algorithms on Reconfigurable Meshes

We present a selection of related algorithms which run in Θ(log(n)) expected time for random graphs on the modestly reconfigurable architecture known as the Mesh with Row and Column Subbuses (RCS-Mesh). Notably, this base model has been implemented as part of the communication architecture of the MasPar MP series [17]; in addition, algorithms for RCS-Mesh can be directly implemented on the more...

Optimal Algorithms for Constrained Reconfigurable Meshes

This paper introduces a constrained recon gurable mesh model which incorpo rates practical assumptions about propagation delays on large sized buses Sim ulations of AT optimal recon gurable mesh algorithms on the constrained re con gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems requiring less area are then presented For the problems inv...